A Central Limit Theorem for Convex
نویسندگان
چکیده
Points P1; : : : ; Pn in the unit square de ne a convex n-chain if they are below y = x and, together with P0 = (0; 0) and Pn+1 = (1; 1), they are in convex position. Under uniform probability, we prove an almost sure limit theorem for these chains that uses only probabilistic arguments, and which strengthens similar limit shape statements established by other authors. An interesting feature is that the limit shape is a direct consequence of the method. The main result is an accompanying central limit theorem for these chains. A weak convergence result implies several other statements concerning the deviations between random convex chains and their limit.
منابع مشابه
Central Limit Theorem in Multitype Branching Random Walk
A discrete time multitype (p-type) branching random walk on the real line R is considered. The positions of the j-type individuals in the n-th generation form a point process. The asymptotic behavior of these point processes, when the generation size tends to infinity, is studied. The central limit theorem is proved.
متن کاملThe Local Limit Theorem: A Historical Perspective
The local limit theorem describes how the density of a sum of random variables follows the normal curve. However the local limit theorem is often seen as a curiosity of no particular importance when compared with the central limit theorem. Nevertheless the local limit theorem came first and is in fact associated with the foundation of probability theory by Blaise Pascal and Pierre de Fer...
متن کاملA Central Limit Theorem for Convex Chains in the Square
Points P1, . . . , Pn in the unit square define a convex n-chain if they are below y = x and, together with P0 = (0, 0) and Pn+1 = (1, 1), they are in convex position. Under uniform probability, we prove an almost sure limit theorem for these chains that uses only probabilistic arguments, and which strengthens similar limit shape statements established by other authors. An interesting feature i...
متن کاملCentral Limit Theorems for Random Polytopes in a Smooth Convex Set
Let K be a smooth convex set with volume one in R. Choose n random points in K independently according to the uniform distribution. The convex hull of these points, denoted by Kn, is called a random polytope. We prove that several key functionals of Kn satisfy the central limit theorem as n tends to infinity.
متن کامل